A lower bound for the number of orientable triangular embeddings of some complete graphs
نویسندگان
چکیده
We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic face 2-colourable triangular embeddings of the complete graph Kn in an orientable surface is at least nan 2 . AMS classification: 05B07, 05C10.
منابع مشابه
Triangular embeddings of complete graphs
In this paper we describe the generation of all nonorientable triangular embeddings of the complete graphs K12 and K13. (The 59 nonisomorphic orientable triangular embeddings of K12 were found in 1996 by Altshuler, Bokowski and Schuchert, and K13 has no orientable triangular embeddings.) There are 182, 200 nonisomorphic nonorientable triangular embeddings for K12, and 243, 088, 286 for K13. Tri...
متن کاملBiembeddings of Metacyclic Groups and Triangulations of Orientable Surfaces by Complete Graphs
For each integer n > 3, n 6= 4, for each odd integer m > 3, and for any λ ∈ Zn of (multiplicative) order m′ where m′ | m, we construct a biembedding of Latin squares in which one of the squares is the Cayley table of the metacyclic group Zm nλ Zn. This extends the spectrum of Latin squares known to be biembeddable. The best existing lower bounds for the number of triangular embeddings of a comp...
متن کاملTriangulations of orientable surfaces by complete tripartite graphs
Orientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biembeddings of Latin squares. We show that if n is prime there are at least e ln n−n(1+o(1)) nonisomorphic biembeddings of cyclic Latin squares of order n. If n = kp, where p is a large prime number, then the number of nonisomorphic biembeddings of cyclic Latin squares of order n is at least e ln p−p(1+ln . ...
متن کاملOn Biembeddings of Latin Squares
A known construction for face 2-colourable triangular embeddings of complete regular tripartite graphs is re-examined from the viewpoint of the underlying Latin squares. This facilitates biembeddings of a wide variety of Latin squares, including those formed from the Cayley tables of the elementary Abelian 2-groups Ck 2 (k 6= 2). In turn, these biembeddings enable us to increase the best known ...
متن کاملOn strongly 2-multiplicative graphs
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010